<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>Navo Portable Library: navo/algorithm/nonlinear/binary/sblnk.c源文件</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/search.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css"/>
</head>
<body onload='searchBox.OnSelectItem(0);'>
<!-- 制作者 Doxygen 1.7.3 -->
<script type="text/javascript"><!--
var searchBox = new SearchBox("searchBox", "search",false,'搜索');
--></script>
<div id="top">
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td style="padding-left: 0.5em;">
   <div id="projectname">Navo Portable Library&#160;<span id="projectnumber">Ver 1.0.20120827</span></div>
   <div id="projectbrief">Provides generic platform independent facilities.</div>
  </td>
 </tr>
 </tbody>
</table>
</div>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>首页</span></a></li>
      <li><a href="modules.html"><span>模块</span></a></li>
      <li><a href="annotated.html"><span>数据结构</span></a></li>
      <li class="current"><a href="files.html"><span>文件</span></a></li>
      <li id="searchli">
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="搜索" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>文件列表</span></a></li>
      <li><a href="globals.html"><span>全局定义</span></a></li>
    </ul>
  </div>
<div class="header">
  <div class="headertitle">
<h1>navo/algorithm/nonlinear/binary/sblnk.c</h1>  </div>
</div>
<div class="contents">
<a href="sblnk_8c.html">浏览该文件的文档。</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/* -*- Mode: C; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*- */</span>
<a name="l00011"></a>00011 <span class="preprocessor">#include &quot;<a class="code" href="sblnk_8h.html" title="Size-balanced linked tree.">sblnk.h</a>&quot;</span>
<a name="l00012"></a>00012 
<a name="l00013"></a>00013 <span class="preprocessor">#ifdef _MSC_VER</span>
<a name="l00014"></a>00014 <span class="preprocessor"></span><span class="preprocessor">#pragma optimize(&quot;t&quot;, on)</span>
<a name="l00015"></a>00015 <span class="preprocessor"></span><span class="preprocessor">#endif  </span><span class="comment">/* #ifdef _MSC_VER */</span>
<a name="l00016"></a>00016 
<a name="l00017"></a>00017 <span class="preprocessor">#ifdef __cplusplus</span>
<a name="l00018"></a>00018 <span class="preprocessor"></span><span class="keyword">extern</span> <span class="stringliteral">&quot;C&quot;</span> {
<a name="l00019"></a>00019 <span class="preprocessor">#endif </span><span class="comment">/* #ifdef __cplusplus */</span>
<a name="l00020"></a>00020 
<a name="l00021"></a>00021 <span class="keyword">static</span> <span class="keyword">inline</span> sblnk_link_left(<a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> parent, <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> child)
<a name="l00022"></a>00022 {
<a name="l00023"></a>00023     parent-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a> = child;
<a name="l00024"></a>00024     <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga570d0615947869f006d217e1c5b68685" title="仅在node不为空时，设置node的父节点">sblnk_set_parent_if</a>(child, parent);
<a name="l00025"></a>00025 }
<a name="l00026"></a>00026 
<a name="l00027"></a>00027 <span class="keyword">static</span> <span class="keyword">inline</span> sblnk_link_right(<a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> parent, <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> child)
<a name="l00028"></a>00028 {
<a name="l00029"></a>00029     parent-&gt;<a class="code" href="struct____sblnk__node.html#a1f41e1366c9345596b528fc6aee3187d" title="右子节点">right</a> = child;
<a name="l00030"></a>00030     <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga570d0615947869f006d217e1c5b68685" title="仅在node不为空时，设置node的父节点">sblnk_set_parent_if</a>(child, parent);
<a name="l00031"></a>00031 }
<a name="l00032"></a>00032 
<a name="l00033"></a>00033 <span class="keyword">static</span> <span class="keyword">inline</span> sblnk_link_left_unsafe(<a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> parent, <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> child)
<a name="l00034"></a>00034 {
<a name="l00035"></a>00035     parent-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a> = child;
<a name="l00036"></a>00036     child-&gt;<a class="code" href="struct____sblnk__node.html#a0ded92074b972d02336b48bb31f92d06" title="父节点">parent</a> = parent;
<a name="l00037"></a>00037 }
<a name="l00038"></a>00038 
<a name="l00039"></a>00039 <span class="keyword">static</span> <span class="keyword">inline</span> sblnk_link_right_unsafe(<a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> parent, <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> child)
<a name="l00040"></a>00040 {
<a name="l00041"></a>00041     parent-&gt;<a class="code" href="struct____sblnk__node.html#a1f41e1366c9345596b528fc6aee3187d" title="右子节点">right</a> = child;
<a name="l00042"></a>00042     child-&gt;<a class="code" href="struct____sblnk__node.html#a0ded92074b972d02336b48bb31f92d06" title="父节点">parent</a> = parent;
<a name="l00043"></a>00043 }
<a name="l00044"></a>00044 
<a name="l00045"></a>00045 <span class="keyword">static</span> <span class="keyword">inline</span> sblnk_link_left_shift(<a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> parent, <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> child)
<a name="l00046"></a>00046 {
<a name="l00047"></a>00047     parent-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a> = child;
<a name="l00048"></a>00048     <span class="keywordflow">if</span> (child) {
<a name="l00049"></a>00049         child-&gt;<a class="code" href="struct____sblnk__node.html#a0ded92074b972d02336b48bb31f92d06" title="父节点">parent</a> = parent;
<a name="l00050"></a>00050         parent-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a> += (child-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a> + 1);
<a name="l00051"></a>00051     }
<a name="l00052"></a>00052 }
<a name="l00053"></a>00053 
<a name="l00054"></a>00054 <span class="keyword">static</span> <span class="keyword">inline</span> sblnk_link_right_shift(<a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> parent, <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> child)
<a name="l00055"></a>00055 {
<a name="l00056"></a>00056     parent-&gt;<a class="code" href="struct____sblnk__node.html#a1f41e1366c9345596b528fc6aee3187d" title="右子节点">right</a> = child;
<a name="l00057"></a>00057     <span class="keywordflow">if</span> (child) {
<a name="l00058"></a>00058         child-&gt;<a class="code" href="struct____sblnk__node.html#a0ded92074b972d02336b48bb31f92d06" title="父节点">parent</a> = parent;
<a name="l00059"></a>00059         parent-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a> += (child-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a> + 1);
<a name="l00060"></a>00060     }
<a name="l00061"></a>00061 }
<a name="l00062"></a>00062 
<a name="l00063"></a>00063 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> sblnk_replace_child(<a class="code" href="structsblnk__root.html" title="树根">sblnk_root</a>* root, <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> me, 
<a name="l00064"></a>00064                         <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> old_child, <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> new_child)
<a name="l00065"></a>00065 {
<a name="l00066"></a>00066     <span class="keywordflow">if</span> (me) {
<a name="l00067"></a>00067         <span class="keywordflow">if</span> (old_child == me-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a>)
<a name="l00068"></a>00068             me-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a> = new_child;
<a name="l00069"></a>00069         <span class="keywordflow">else</span>
<a name="l00070"></a>00070             me-&gt;<a class="code" href="struct____sblnk__node.html#a1f41e1366c9345596b528fc6aee3187d" title="右子节点">right</a> = new_child;
<a name="l00071"></a>00071     } <span class="keywordflow">else</span>
<a name="l00072"></a>00072         root-&gt;<a class="code" href="structsblnk__root.html#a5b775a8ecc9de098808ca8c7f1e365c4" title="树根节点">node</a> = new_child;
<a name="l00073"></a>00073 }
<a name="l00074"></a>00074 
<a name="l00075"></a>00075 <span class="comment">/* 对top节点进行左旋转 */</span>
<a name="l00076"></a>00076 <span class="keyword">static</span> <span class="keywordtype">void</span> sblnk_rotate_left(<a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_node</a>* top, <a class="code" href="structsblnk__root.html" title="树根">sblnk_root</a>* root)
<a name="l00077"></a>00077 {
<a name="l00078"></a>00078     <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_node</a>* parent = top-&gt;<a class="code" href="struct____sblnk__node.html#a0ded92074b972d02336b48bb31f92d06" title="父节点">parent</a>;
<a name="l00079"></a>00079     <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_node</a>* node = top-&gt;<a class="code" href="struct____sblnk__node.html#a1f41e1366c9345596b528fc6aee3187d" title="右子节点">right</a>;
<a name="l00080"></a>00080     <span class="keywordtype">size_t</span> tsz = top-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a>;
<a name="l00081"></a>00081     top-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a> -= (node-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a> + 1);
<a name="l00082"></a>00082     sblnk_link_right_shift(top, node-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a>);
<a name="l00083"></a>00083     node-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a> = tsz;
<a name="l00084"></a>00084     sblnk_link_left_unsafe(node, top);
<a name="l00085"></a>00085     sblnk_replace_child(root, parent, top, node);
<a name="l00086"></a>00086     node-&gt;<a class="code" href="struct____sblnk__node.html#a0ded92074b972d02336b48bb31f92d06" title="父节点">parent</a> = parent;
<a name="l00087"></a>00087 }
<a name="l00088"></a>00088 
<a name="l00089"></a>00089 <span class="comment">/* 对top节点进行右旋转 */</span>
<a name="l00090"></a>00090 <span class="keyword">static</span> <span class="keywordtype">void</span> sblnk_rotate_right(<a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_node</a>* top, <a class="code" href="structsblnk__root.html" title="树根">sblnk_root</a>* root)
<a name="l00091"></a>00091 {
<a name="l00092"></a>00092     <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_node</a>* parent = top-&gt;<a class="code" href="struct____sblnk__node.html#a0ded92074b972d02336b48bb31f92d06" title="父节点">parent</a>;
<a name="l00093"></a>00093     <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_node</a>* node = top-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a>;
<a name="l00094"></a>00094     <span class="keywordtype">size_t</span> tsz = top-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a>;
<a name="l00095"></a>00095     top-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a> -= (node-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a> + 1);
<a name="l00096"></a>00096     sblnk_link_left_shift(top, node-&gt;<a class="code" href="struct____sblnk__node.html#a1f41e1366c9345596b528fc6aee3187d" title="右子节点">right</a>);
<a name="l00097"></a>00097     node-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a> = tsz;
<a name="l00098"></a>00098     sblnk_link_right_unsafe(node, top);
<a name="l00099"></a>00099     sblnk_replace_child(root, parent, top, node);
<a name="l00100"></a>00100     node-&gt;<a class="code" href="struct____sblnk__node.html#a0ded92074b972d02336b48bb31f92d06" title="父节点">parent</a> = parent;
<a name="l00101"></a>00101 }
<a name="l00102"></a>00102 
<a name="l00103"></a><a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga19c2e9e6ec1788d13f34c1f230b47d02">00103</a> NV_IMPL <span class="keywordtype">void</span> <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga19c2e9e6ec1788d13f34c1f230b47d02" title="插入节点后，对树进行调整">sblnk_maintain</a>(<a class="code" href="structsblnk__root.html" title="树根">sblnk_root</a>* root, <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_node</a>* node, 
<a name="l00104"></a>00104                                 <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_node</a>* parent)
<a name="l00105"></a>00105 {
<a name="l00106"></a>00106     <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> sibling;
<a name="l00107"></a>00107 
<a name="l00108"></a>00108     <span class="keywordflow">while</span> (parent) {
<a name="l00109"></a>00109         ++parent-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a>;
<a name="l00110"></a>00110         <span class="keywordflow">if</span> (node == parent-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a>) {
<a name="l00111"></a>00111             <span class="keywordflow">if</span> (sibling = parent-&gt;<a class="code" href="struct____sblnk__node.html#a1f41e1366c9345596b528fc6aee3187d" title="右子节点">right</a>) {
<a name="l00112"></a>00112                 <span class="comment">/* 如果存在兄弟节点，而兄弟节点有子节点且子节点的大小</span>
<a name="l00113"></a>00113 <span class="comment">                 * 大于node节点的大小，则旋转树</span>
<a name="l00114"></a>00114 <span class="comment">                 */</span>
<a name="l00115"></a>00115                 <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> left = sibling-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a>;
<a name="l00116"></a>00116                 <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> right = sibling-&gt;<a class="code" href="struct____sblnk__node.html#a1f41e1366c9345596b528fc6aee3187d" title="右子节点">right</a>;
<a name="l00117"></a>00117                 <span class="keywordflow">if</span> (right &amp;&amp; right-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a> &gt; node-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a>) {
<a name="l00118"></a>00118                     sblnk_rotate_left(parent, root);
<a name="l00119"></a>00119                     parent = sibling;
<a name="l00120"></a>00120                 } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (left &amp;&amp; left-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a> &gt; node-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a>) {
<a name="l00121"></a>00121                     sblnk_rotate_right(sibling, root);
<a name="l00122"></a>00122                     sblnk_rotate_left(parent, root);
<a name="l00123"></a>00123                     parent = left;
<a name="l00124"></a>00124                 } <span class="keywordflow">else</span> {
<a name="l00125"></a>00125                     <span class="comment">/* 如果兄弟节点没有子节点，或者子节点不大于node节点，</span>
<a name="l00126"></a>00126 <span class="comment">                     * 反过来判断node节点的子节点大小是否大于兄弟节点的</span>
<a name="l00127"></a>00127 <span class="comment">                     * 大小，如果大于，则旋转树</span>
<a name="l00128"></a>00128 <span class="comment">                     */</span>
<a name="l00129"></a>00129                     left = node-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a>;
<a name="l00130"></a>00130                     right = node-&gt;<a class="code" href="struct____sblnk__node.html#a1f41e1366c9345596b528fc6aee3187d" title="右子节点">right</a>;
<a name="l00131"></a>00131                     <span class="keywordflow">if</span> (left &amp;&amp; left-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a> &gt; sibling-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a>) {
<a name="l00132"></a>00132                         sblnk_rotate_right(parent, root);
<a name="l00133"></a>00133                         parent = node;
<a name="l00134"></a>00134                     } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (right &amp;&amp; right-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a> &gt; sibling-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a>) {
<a name="l00135"></a>00135                         sblnk_rotate_left(node, root);
<a name="l00136"></a>00136                         sblnk_rotate_right(parent, root);
<a name="l00137"></a>00137                         parent = right;
<a name="l00138"></a>00138                     }
<a name="l00139"></a>00139                 }
<a name="l00140"></a>00140             } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (node-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a>) {
<a name="l00141"></a>00141                 <span class="comment">/* 不存在兄弟节点，那么如果node节点存在子节点，则旋转树 */</span>
<a name="l00142"></a>00142                 sblnk_rotate_right(parent, root);
<a name="l00143"></a>00143                 parent = node;
<a name="l00144"></a>00144             }
<a name="l00145"></a>00145             node = parent;
<a name="l00146"></a>00146             parent = node-&gt;<a class="code" href="struct____sblnk__node.html#a0ded92074b972d02336b48bb31f92d06" title="父节点">parent</a>;
<a name="l00147"></a>00147         } <span class="keywordflow">else</span> {
<a name="l00148"></a>00148             <span class="keywordflow">if</span> (sibling = parent-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a>) {
<a name="l00149"></a>00149                 <span class="comment">/* 如果存在兄弟节点，而兄弟节点有子节点且子节点的大小</span>
<a name="l00150"></a>00150 <span class="comment">                 * 大于node节点的大小，则旋转树</span>
<a name="l00151"></a>00151 <span class="comment">                 */</span>
<a name="l00152"></a>00152                 <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> left = sibling-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a>;
<a name="l00153"></a>00153                 <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> right = sibling-&gt;<a class="code" href="struct____sblnk__node.html#a1f41e1366c9345596b528fc6aee3187d" title="右子节点">right</a>;
<a name="l00154"></a>00154                 <span class="keywordflow">if</span> (left &amp;&amp; left-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a> &gt; node-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a>) {
<a name="l00155"></a>00155                     sblnk_rotate_right(parent, root);
<a name="l00156"></a>00156                     parent = sibling;
<a name="l00157"></a>00157                 } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (right &amp;&amp; right-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a> &gt; node-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a>) {
<a name="l00158"></a>00158                     sblnk_rotate_left(sibling, root);
<a name="l00159"></a>00159                     sblnk_rotate_right(parent, root);
<a name="l00160"></a>00160                     parent = right;
<a name="l00161"></a>00161                 } <span class="keywordflow">else</span> {
<a name="l00162"></a>00162                     <span class="comment">/* 如果兄弟节点没有子节点，或者子节点不大于node节点，</span>
<a name="l00163"></a>00163 <span class="comment">                     * 反过来判断node节点的子节点大小是否大于兄弟节点的</span>
<a name="l00164"></a>00164 <span class="comment">                     * 大小，如果大于，则旋转树</span>
<a name="l00165"></a>00165 <span class="comment">                     */</span>
<a name="l00166"></a>00166                     left = node-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a>;
<a name="l00167"></a>00167                     right = node-&gt;<a class="code" href="struct____sblnk__node.html#a1f41e1366c9345596b528fc6aee3187d" title="右子节点">right</a>;
<a name="l00168"></a>00168                     <span class="keywordflow">if</span> (right &amp;&amp; right-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a> &gt; sibling-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a>) {
<a name="l00169"></a>00169                         sblnk_rotate_left(parent, root);
<a name="l00170"></a>00170                         parent = node;
<a name="l00171"></a>00171                     } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (left &amp;&amp; left-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a> &gt; sibling-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a>) {
<a name="l00172"></a>00172                         sblnk_rotate_right(node, root);
<a name="l00173"></a>00173                         sblnk_rotate_left(parent, root);
<a name="l00174"></a>00174                         parent = left;
<a name="l00175"></a>00175                     }
<a name="l00176"></a>00176                 }
<a name="l00177"></a>00177             } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (node-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a>) {
<a name="l00178"></a>00178                 <span class="comment">/* 不存在兄弟节点，那么如果node节点存在子节点，则旋转树 */</span>
<a name="l00179"></a>00179                 sblnk_rotate_left(parent, root);
<a name="l00180"></a>00180                 parent = node;
<a name="l00181"></a>00181             }
<a name="l00182"></a>00182             node = parent;
<a name="l00183"></a>00183             parent = node-&gt;<a class="code" href="struct____sblnk__node.html#a0ded92074b972d02336b48bb31f92d06" title="父节点">parent</a>;
<a name="l00184"></a>00184         }
<a name="l00185"></a>00185     }
<a name="l00186"></a>00186 }
<a name="l00187"></a>00187 
<a name="l00188"></a>00188 <span class="keyword">static</span> <span class="keywordtype">void</span> __sblnk_maintain_on_erase(<a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_node</a>* node, 
<a name="l00189"></a>00189                     <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_node</a>* parent, <a class="code" href="structsblnk__root.html" title="树根">sblnk_root</a>* root, <span class="keywordtype">int</span> which)
<a name="l00190"></a>00190 {
<a name="l00191"></a>00191     <span class="keywordflow">if</span> (parent) {
<a name="l00192"></a>00192         <span class="keywordflow">if</span> (which)
<a name="l00193"></a>00193             <span class="keywordflow">goto</span> __SBLNK_MAINTAIN_ON_ERASE_RT;
<a name="l00194"></a>00194         <span class="keywordflow">else</span>
<a name="l00195"></a>00195             <span class="keywordflow">goto</span> __SBLNK_MAINTAIN_ON_ERASE_LT;
<a name="l00196"></a>00196 
<a name="l00197"></a>00197         <span class="keywordflow">do</span> {
<a name="l00198"></a>00198             <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> sibling;
<a name="l00199"></a>00199 
<a name="l00200"></a>00200             --parent-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a>;
<a name="l00201"></a>00201             <span class="keywordflow">if</span> (node == parent-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a>) {
<a name="l00202"></a>00202 __SBLNK_MAINTAIN_ON_ERASE_LT:
<a name="l00203"></a>00203                 sibling = parent-&gt;<a class="code" href="struct____sblnk__node.html#a1f41e1366c9345596b528fc6aee3187d" title="右子节点">right</a>;
<a name="l00204"></a>00204                 <span class="keywordflow">if</span> (node) {
<a name="l00205"></a>00205                     <span class="comment">/* 如果node不为空 */</span>
<a name="l00206"></a>00206                     <span class="keywordflow">if</span> (sibling) {
<a name="l00207"></a>00207                         <span class="comment">/* 如果存在兄弟节点，而兄弟节点有子节点且子节点的大小</span>
<a name="l00208"></a>00208 <span class="comment">                         * 大于node节点的大小，则旋转树</span>
<a name="l00209"></a>00209 <span class="comment">                         */</span>
<a name="l00210"></a>00210                         <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> left = sibling-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a>;
<a name="l00211"></a>00211                         <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> right = sibling-&gt;<a class="code" href="struct____sblnk__node.html#a1f41e1366c9345596b528fc6aee3187d" title="右子节点">right</a>;
<a name="l00212"></a>00212                         <span class="keywordflow">if</span> (right &amp;&amp; right-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a> &gt; node-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a>) {
<a name="l00213"></a>00213                             sblnk_rotate_left(parent, root);
<a name="l00214"></a>00214                             parent = sibling;
<a name="l00215"></a>00215                         } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (left &amp;&amp; left-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a> &gt; node-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a>) {
<a name="l00216"></a>00216                             sblnk_rotate_right(sibling, root);
<a name="l00217"></a>00217                             sblnk_rotate_left(parent, root);
<a name="l00218"></a>00218                             parent = left;
<a name="l00219"></a>00219                         } <span class="keywordflow">else</span> {
<a name="l00220"></a>00220                             <span class="comment">/* 如果兄弟节点没有子节点，或者子节点不大于node节点，</span>
<a name="l00221"></a>00221 <span class="comment">                             * 反过来判断node节点的子节点大小是否大于兄弟节点的</span>
<a name="l00222"></a>00222 <span class="comment">                             * 大小，如果大于，则旋转树</span>
<a name="l00223"></a>00223 <span class="comment">                             */</span>
<a name="l00224"></a>00224                             left = node-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a>;
<a name="l00225"></a>00225                             right = node-&gt;<a class="code" href="struct____sblnk__node.html#a1f41e1366c9345596b528fc6aee3187d" title="右子节点">right</a>;
<a name="l00226"></a>00226                             <span class="keywordflow">if</span> (left &amp;&amp; left-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a> &gt; sibling-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a>) {
<a name="l00227"></a>00227                                 sblnk_rotate_right(parent, root);
<a name="l00228"></a>00228                                 parent = node;
<a name="l00229"></a>00229                             } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (right &amp;&amp; right-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a> &gt; sibling-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a>) {
<a name="l00230"></a>00230                                 sblnk_rotate_left(node, root);
<a name="l00231"></a>00231                                 sblnk_rotate_right(parent, root);
<a name="l00232"></a>00232                                 parent = right;
<a name="l00233"></a>00233                             }
<a name="l00234"></a>00234                         }
<a name="l00235"></a>00235                     } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (node-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a>) {
<a name="l00236"></a>00236                         <span class="comment">/* 不存在兄弟节点，那么如果node节点存在子节点，则旋转树 */</span>
<a name="l00237"></a>00237                         sblnk_rotate_right(parent, root);
<a name="l00238"></a>00238                         parent = node;
<a name="l00239"></a>00239                     }
<a name="l00240"></a>00240                 } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (sibling) {
<a name="l00241"></a>00241                     <span class="comment">/* 如果node为空且存在兄弟节点 */</span>
<a name="l00242"></a>00242                     <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> left = sibling-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a>;
<a name="l00243"></a>00243                     <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> right = sibling-&gt;<a class="code" href="struct____sblnk__node.html#a1f41e1366c9345596b528fc6aee3187d" title="右子节点">right</a>;
<a name="l00244"></a>00244                     <span class="keywordflow">if</span> (right) {
<a name="l00245"></a>00245                         sblnk_rotate_left(parent, root);
<a name="l00246"></a>00246                         parent = sibling;
<a name="l00247"></a>00247                     } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (left) {
<a name="l00248"></a>00248                         sblnk_rotate_right(sibling, root);
<a name="l00249"></a>00249                         sblnk_rotate_left(parent, root);
<a name="l00250"></a>00250                         parent = left;
<a name="l00251"></a>00251                     }
<a name="l00252"></a>00252                 }
<a name="l00253"></a>00253                 node = parent;
<a name="l00254"></a>00254                 parent = node-&gt;<a class="code" href="struct____sblnk__node.html#a0ded92074b972d02336b48bb31f92d06" title="父节点">parent</a>;
<a name="l00255"></a>00255             } <span class="keywordflow">else</span> {
<a name="l00256"></a>00256 __SBLNK_MAINTAIN_ON_ERASE_RT:
<a name="l00257"></a>00257                 sibling = parent-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a>;
<a name="l00258"></a>00258                 <span class="keywordflow">if</span> (node) {
<a name="l00259"></a>00259                     <span class="comment">/* 如果node不为空 */</span>
<a name="l00260"></a>00260                     <span class="keywordflow">if</span> (sibling) {
<a name="l00261"></a>00261                         <span class="comment">/* 如果存在兄弟节点，而兄弟节点有子节点且子节点的大小</span>
<a name="l00262"></a>00262 <span class="comment">                         * 大于node节点的大小，则旋转树</span>
<a name="l00263"></a>00263 <span class="comment">                         */</span>
<a name="l00264"></a>00264                         <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> left = sibling-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a>;
<a name="l00265"></a>00265                         <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> right = sibling-&gt;<a class="code" href="struct____sblnk__node.html#a1f41e1366c9345596b528fc6aee3187d" title="右子节点">right</a>;
<a name="l00266"></a>00266                         <span class="keywordflow">if</span> (left &amp;&amp; left-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a> &gt; node-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a>) {
<a name="l00267"></a>00267                             sblnk_rotate_right(parent, root);
<a name="l00268"></a>00268                             parent = sibling;
<a name="l00269"></a>00269                         } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (right &amp;&amp; right-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a> &gt; node-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a>) {
<a name="l00270"></a>00270                             sblnk_rotate_left(sibling, root);
<a name="l00271"></a>00271                             sblnk_rotate_right(parent, root);
<a name="l00272"></a>00272                             parent = right;
<a name="l00273"></a>00273                         } <span class="keywordflow">else</span> {
<a name="l00274"></a>00274                             <span class="comment">/* 如果兄弟节点没有子节点，或者子节点不大于node节点，</span>
<a name="l00275"></a>00275 <span class="comment">                             * 反过来判断node节点的子节点大小是否大于兄弟节点的</span>
<a name="l00276"></a>00276 <span class="comment">                             * 大小，如果大于，则旋转树</span>
<a name="l00277"></a>00277 <span class="comment">                             */</span>
<a name="l00278"></a>00278                             left = node-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a>;
<a name="l00279"></a>00279                             right = node-&gt;<a class="code" href="struct____sblnk__node.html#a1f41e1366c9345596b528fc6aee3187d" title="右子节点">right</a>;
<a name="l00280"></a>00280                             <span class="keywordflow">if</span> (right &amp;&amp; right-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a> &gt; sibling-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a>) {
<a name="l00281"></a>00281                                 sblnk_rotate_left(parent, root);
<a name="l00282"></a>00282                                 parent = node;
<a name="l00283"></a>00283                             } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (left &amp;&amp; left-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a> &gt; sibling-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a>) {
<a name="l00284"></a>00284                                 sblnk_rotate_right(node, root);
<a name="l00285"></a>00285                                 sblnk_rotate_left(parent, root);
<a name="l00286"></a>00286                                 parent = left;
<a name="l00287"></a>00287                             }
<a name="l00288"></a>00288                         }
<a name="l00289"></a>00289                     } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (node-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a>) {
<a name="l00290"></a>00290                         <span class="comment">/* 不存在兄弟节点，那么如果node节点存在子节点，则旋转树 */</span>
<a name="l00291"></a>00291                         sblnk_rotate_left(parent, root);
<a name="l00292"></a>00292                         parent = node;
<a name="l00293"></a>00293                     }
<a name="l00294"></a>00294                 } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (sibling) {
<a name="l00295"></a>00295                     <span class="comment">/* 如果node为空且存在兄弟节点 */</span>
<a name="l00296"></a>00296                     <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> left = sibling-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a>;
<a name="l00297"></a>00297                     <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> right = sibling-&gt;<a class="code" href="struct____sblnk__node.html#a1f41e1366c9345596b528fc6aee3187d" title="右子节点">right</a>;
<a name="l00298"></a>00298                     <span class="keywordflow">if</span> (left) {
<a name="l00299"></a>00299                         sblnk_rotate_right(parent, root);
<a name="l00300"></a>00300                         parent = sibling;
<a name="l00301"></a>00301                     } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (right) {
<a name="l00302"></a>00302                         sblnk_rotate_left(sibling, root);
<a name="l00303"></a>00303                         sblnk_rotate_right(parent, root);
<a name="l00304"></a>00304                         parent = right;
<a name="l00305"></a>00305                     }
<a name="l00306"></a>00306                 }
<a name="l00307"></a>00307                 node = parent;
<a name="l00308"></a>00308                 parent = node-&gt;<a class="code" href="struct____sblnk__node.html#a0ded92074b972d02336b48bb31f92d06" title="父节点">parent</a>;
<a name="l00309"></a>00309             }
<a name="l00310"></a>00310         } <span class="keywordflow">while</span> (parent);
<a name="l00311"></a>00311     }
<a name="l00312"></a>00312 }
<a name="l00313"></a>00313 
<a name="l00314"></a><a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga87e9e7a65a0850fb3b02455a2a9e54d2">00314</a> NV_IMPL <span class="keywordtype">void</span> <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga87e9e7a65a0850fb3b02455a2a9e54d2" title="移除某个节点">sblnk_erase</a>(<a class="code" href="structsblnk__root.html" title="树根">sblnk_root</a>* root, <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_node</a>* entry)
<a name="l00315"></a>00315 {
<a name="l00316"></a>00316     <span class="keywordtype">int</span> which = 1;
<a name="l00317"></a>00317     <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_node</a>* child;
<a name="l00318"></a>00318     <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_node</a>* parent = entry-&gt;<a class="code" href="struct____sblnk__node.html#a0ded92074b972d02336b48bb31f92d06" title="父节点">parent</a>;
<a name="l00319"></a>00319 
<a name="l00320"></a>00320     <span class="keywordflow">do</span> {<span class="comment">/* 如果entry节点最多只有一个孩子，则直接删除entry节点</span>
<a name="l00321"></a>00321 <span class="comment">         * 并调整树，如果entry同时有两个孩子，需要将其转换成</span>
<a name="l00322"></a>00322 <span class="comment">         * 只有一子或无子的情况</span>
<a name="l00323"></a>00323 <span class="comment">         */</span>
<a name="l00324"></a>00324         <span class="keywordflow">if</span> (!entry-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a>) {
<a name="l00325"></a>00325             child = entry-&gt;<a class="code" href="struct____sblnk__node.html#a1f41e1366c9345596b528fc6aee3187d" title="右子节点">right</a>;
<a name="l00326"></a>00326         } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!entry-&gt;<a class="code" href="struct____sblnk__node.html#a1f41e1366c9345596b528fc6aee3187d" title="右子节点">right</a>) {
<a name="l00327"></a>00327             child = entry-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a>;
<a name="l00328"></a>00328             which = 0;
<a name="l00329"></a>00329         } <span class="keywordflow">else</span> {
<a name="l00330"></a>00330             <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_node</a>* node = entry-&gt;<a class="code" href="struct____sblnk__node.html#a1f41e1366c9345596b528fc6aee3187d" title="右子节点">right</a>;
<a name="l00331"></a>00331             <span class="comment">/* 找到最靠近entry节点右边的节点来交换，</span>
<a name="l00332"></a>00332 <span class="comment">             * 方法是先找右节点，再循环向左找到最左</span>
<a name="l00333"></a>00333 <span class="comment">             * 端的node节点，将该节点替换到entry节</span>
<a name="l00334"></a>00334 <span class="comment">             * 点的位置，此时树性质不受影响，问题转</span>
<a name="l00335"></a>00335 <span class="comment">             * 变成了删除找到的node节点的问题</span>
<a name="l00336"></a>00336 <span class="comment">             */</span>
<a name="l00337"></a>00337             <span class="keywordflow">while</span> (node-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a>)
<a name="l00338"></a>00338                 node = node-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a>;
<a name="l00339"></a>00339             <span class="comment">/* 将node节点设为entry父节点的孩子 */</span>
<a name="l00340"></a>00340             sblnk_replace_child(root, parent, entry, node);
<a name="l00341"></a>00341             <span class="comment">/* 记录node节点原来的节点信息，用于树的调整 */</span>
<a name="l00342"></a>00342             child = node-&gt;<a class="code" href="struct____sblnk__node.html#a1f41e1366c9345596b528fc6aee3187d" title="右子节点">right</a>;
<a name="l00343"></a>00343             parent = node-&gt;<a class="code" href="struct____sblnk__node.html#a0ded92074b972d02336b48bb31f92d06" title="父节点">parent</a>;
<a name="l00344"></a>00344             <span class="keywordflow">if</span> (parent == entry) {
<a name="l00345"></a>00345                 <span class="comment">/* 说明找到的node节点是entry的右子 */</span>
<a name="l00346"></a>00346                 parent = node;
<a name="l00347"></a>00347             } <span class="keywordflow">else</span> {
<a name="l00348"></a>00348                 <span class="comment">/* 替换entry节点到node节点，相当</span>
<a name="l00349"></a>00349 <span class="comment">                 * 于删除了原来node位置的节点</span>
<a name="l00350"></a>00350 <span class="comment">                 */</span>
<a name="l00351"></a>00351                 <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga570d0615947869f006d217e1c5b68685" title="仅在node不为空时，设置node的父节点">sblnk_set_parent_if</a>(child, parent);
<a name="l00352"></a>00352                 parent-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a> = child;
<a name="l00353"></a>00353                 sblnk_link_right_unsafe(node, entry-&gt;<a class="code" href="struct____sblnk__node.html#a1f41e1366c9345596b528fc6aee3187d" title="右子节点">right</a>);
<a name="l00354"></a>00354             }
<a name="l00355"></a>00355 
<a name="l00356"></a>00356             node-&gt;<a class="code" href="struct____sblnk__node.html#a0ded92074b972d02336b48bb31f92d06" title="父节点">parent</a> = entry-&gt;<a class="code" href="struct____sblnk__node.html#a0ded92074b972d02336b48bb31f92d06" title="父节点">parent</a>;
<a name="l00357"></a>00357             node-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a> = entry-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a>;
<a name="l00358"></a>00358             sblnk_link_left_unsafe(node, entry-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a>);
<a name="l00359"></a>00359 
<a name="l00360"></a>00360             <span class="comment">/* 平衡树 */</span>
<a name="l00361"></a>00361             <span class="keywordflow">break</span>;
<a name="l00362"></a>00362         }
<a name="l00363"></a>00363         <span class="comment">/* 接上面的if和else if，删除entry节点 */</span>
<a name="l00364"></a>00364         <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga570d0615947869f006d217e1c5b68685" title="仅在node不为空时，设置node的父节点">sblnk_set_parent_if</a>(child, parent);
<a name="l00365"></a>00365         sblnk_replace_child(root, parent, entry, child);
<a name="l00366"></a>00366     } <span class="keywordflow">while</span> (0);
<a name="l00367"></a>00367 
<a name="l00368"></a>00368     <span class="comment">/* 平衡树 */</span>
<a name="l00369"></a>00369     __sblnk_maintain_on_erase(child, parent, root, which);
<a name="l00370"></a>00370 }
<a name="l00371"></a>00371 
<a name="l00372"></a><a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga9028bdd9eb8000ed59e1a512af48a37a">00372</a> NV_IMPL <span class="keywordtype">void</span> <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga9028bdd9eb8000ed59e1a512af48a37a" title="移除区域内的节点">sblnk_erases</a>(<a class="code" href="structsblnk__root.html" title="树根">sblnk_root</a>* root, <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> begin, 
<a name="l00373"></a>00373                             <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> end, <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga4af164439491a4ca79da044842819995" title="单参数回调函数指针">sblnk_pr1</a> erase_handler)
<a name="l00374"></a>00374 {
<a name="l00375"></a>00375     <span class="keywordflow">if</span> (erase_handler) {
<a name="l00376"></a>00376         <span class="keywordflow">while</span> (begin != end) {
<a name="l00377"></a>00377             <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> cur = begin;
<a name="l00378"></a>00378             <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga8977419721a1b85610adb2634f136983" title="迭代器递增">sblnk_inc</a>(begin);
<a name="l00379"></a>00379             <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga87e9e7a65a0850fb3b02455a2a9e54d2" title="移除某个节点">sblnk_erase</a>(root, cur);
<a name="l00380"></a>00380             erase_handler(cur);
<a name="l00381"></a>00381         }
<a name="l00382"></a>00382 
<a name="l00383"></a>00383     } <span class="keywordflow">else</span> {
<a name="l00384"></a>00384         <span class="keywordflow">while</span> (begin != end)
<a name="l00385"></a>00385             <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga87e9e7a65a0850fb3b02455a2a9e54d2" title="移除某个节点">sblnk_erase</a>(root, <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gabf3d458264ca15b1c03e37cdbfc12049" title="迭代器后自增">sblnk_inc_later</a>(begin));
<a name="l00386"></a>00386     }
<a name="l00387"></a>00387 }
<a name="l00388"></a>00388 
<a name="l00389"></a><a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga1bc124c75a57627dad7af5cff4588bdb">00389</a> NV_IMPL <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga1bc124c75a57627dad7af5cff4588bdb" title="给迭代器增加一段距离或减小一段距离">sblnk_advance</a>(<a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> cur, <span class="keywordtype">int</span> dist)
<a name="l00390"></a>00390 {
<a name="l00391"></a>00391     <span class="keywordflow">if</span> (dist &gt; 0) {
<a name="l00392"></a>00392         <span class="keywordflow">while</span> (cur &amp;&amp; dist--)
<a name="l00393"></a>00393             <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga8977419721a1b85610adb2634f136983" title="迭代器递增">sblnk_inc</a>(cur);
<a name="l00394"></a>00394     } <span class="keywordflow">else</span> {
<a name="l00395"></a>00395         <span class="keywordflow">while</span> (cur &amp;&amp; dist++)
<a name="l00396"></a>00396             <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga39f8da7ba1e44269c6ec1e7fb0125165" title="迭代器递减">sblnk_dec</a>(cur);
<a name="l00397"></a>00397     }
<a name="l00398"></a>00398     <span class="keywordflow">return</span> cur;
<a name="l00399"></a>00399 }
<a name="l00400"></a>00400 
<a name="l00401"></a><a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga196f18e5e1116a4b96e7dcee0d12db2f">00401</a> NV_IMPL <span class="keywordtype">int</span> <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga196f18e5e1116a4b96e7dcee0d12db2f" title="判断一个节点是否存在于树中">sblnk_exist</a>(<a class="code" href="structsblnk__root.html" title="树根">sblnk_root</a>* root, <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> itr)
<a name="l00402"></a>00402 {
<a name="l00403"></a>00403     <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> i = <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gac564d8aed1991fbf0c3f55bbb4edc709" title="得到树的最左端节点">sblnk_front</a>(root);
<a name="l00404"></a>00404     
<a name="l00405"></a>00405     <span class="keywordflow">while</span> (i) {
<a name="l00406"></a>00406         <span class="keywordflow">if</span> (i == itr)
<a name="l00407"></a>00407             <span class="keywordflow">return</span> 1;
<a name="l00408"></a>00408         <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga8977419721a1b85610adb2634f136983" title="迭代器递增">sblnk_inc</a>(i);
<a name="l00409"></a>00409     }
<a name="l00410"></a>00410     
<a name="l00411"></a>00411     <span class="keywordflow">return</span> 0;
<a name="l00412"></a>00412 }
<a name="l00413"></a>00413 
<a name="l00414"></a><a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gac564d8aed1991fbf0c3f55bbb4edc709">00414</a> NV_IMPL <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gac564d8aed1991fbf0c3f55bbb4edc709" title="得到树的最左端节点">sblnk_front</a>(<a class="code" href="structsblnk__root.html" title="树根">sblnk_root</a>* root)
<a name="l00415"></a>00415 {
<a name="l00416"></a>00416     <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> i = root-&gt;<a class="code" href="structsblnk__root.html#a5b775a8ecc9de098808ca8c7f1e365c4" title="树根节点">node</a>;
<a name="l00417"></a>00417 
<a name="l00418"></a>00418     <span class="keywordflow">if</span> (!i)
<a name="l00419"></a>00419         <span class="keywordflow">return</span> NULL;
<a name="l00420"></a>00420 
<a name="l00421"></a>00421     <span class="comment">/* 一直往左边走，找到最左边的节点 */</span>
<a name="l00422"></a>00422     <span class="keywordflow">while</span> (i-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a>)
<a name="l00423"></a>00423         i = i-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a>;
<a name="l00424"></a>00424 
<a name="l00425"></a>00425     <span class="keywordflow">return</span> i;
<a name="l00426"></a>00426 }
<a name="l00427"></a>00427 
<a name="l00428"></a><a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gaef991ca0f842b85f5ac97941545c025e">00428</a> NV_IMPL <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gaef991ca0f842b85f5ac97941545c025e" title="得到树的最右端节点">sblnk_back</a>(<a class="code" href="structsblnk__root.html" title="树根">sblnk_root</a>* root)
<a name="l00429"></a>00429 {
<a name="l00430"></a>00430     <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> i = root-&gt;<a class="code" href="structsblnk__root.html#a5b775a8ecc9de098808ca8c7f1e365c4" title="树根节点">node</a>;
<a name="l00431"></a>00431     
<a name="l00432"></a>00432     <span class="keywordflow">if</span> (!i)
<a name="l00433"></a>00433         <span class="keywordflow">return</span> NULL;
<a name="l00434"></a>00434     
<a name="l00435"></a>00435     <span class="comment">/* 一直往右边走，找到最右边的节点 */</span>
<a name="l00436"></a>00436     <span class="keywordflow">while</span> (i-&gt;<a class="code" href="struct____sblnk__node.html#a1f41e1366c9345596b528fc6aee3187d" title="右子节点">right</a>)
<a name="l00437"></a>00437         i = i-&gt;<a class="code" href="struct____sblnk__node.html#a1f41e1366c9345596b528fc6aee3187d" title="右子节点">right</a>;
<a name="l00438"></a>00438     
<a name="l00439"></a>00439     <span class="keywordflow">return</span> i;
<a name="l00440"></a>00440 }
<a name="l00441"></a>00441 
<a name="l00442"></a><a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga6bd50f36005fd9ae83c23d0446f79b90">00442</a> NV_IMPL <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga6bd50f36005fd9ae83c23d0446f79b90" title="得到当前节点的中序后继节点">sblnk_next</a>(<a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> cur)
<a name="l00443"></a>00443 {
<a name="l00444"></a>00444     <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> parent;
<a name="l00445"></a>00445     
<a name="l00446"></a>00446     <span class="comment">/* 如果有右孩子，往右边走 */</span>
<a name="l00447"></a>00447     <span class="keywordflow">if</span> (cur-&gt;<a class="code" href="struct____sblnk__node.html#a1f41e1366c9345596b528fc6aee3187d" title="右子节点">right</a>) {
<a name="l00448"></a>00448         cur = cur-&gt;<a class="code" href="struct____sblnk__node.html#a1f41e1366c9345596b528fc6aee3187d" title="右子节点">right</a>;
<a name="l00449"></a>00449         <span class="comment">/* 找右孩子下最靠左的节点 */</span>
<a name="l00450"></a>00450         <span class="keywordflow">while</span> (cur-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a>)
<a name="l00451"></a>00451             cur = cur-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a>;
<a name="l00452"></a>00452         <span class="keywordflow">return</span> cur;
<a name="l00453"></a>00453     }
<a name="l00454"></a>00454     <span class="comment">/* 如果没有右孩子，向父节点走 */</span>
<a name="l00455"></a>00455     <span class="keywordflow">while</span> ((parent = <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga2b84c86f24154173661a6b15a7f8392f" title="得到父节点">sblnk_parent</a>(cur)) 
<a name="l00456"></a>00456             &amp;&amp; cur == parent-&gt;<a class="code" href="struct____sblnk__node.html#a1f41e1366c9345596b528fc6aee3187d" title="右子节点">right</a>)
<a name="l00457"></a>00457         cur = parent;
<a name="l00458"></a>00458     
<a name="l00459"></a>00459     <span class="keywordflow">return</span> parent;
<a name="l00460"></a>00460 }
<a name="l00461"></a>00461 
<a name="l00462"></a><a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga57c68614024a3a41fc416490d9be9f0e">00462</a> NV_IMPL <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga57c68614024a3a41fc416490d9be9f0e" title="得到当前节点的中序前驱节点">sblnk_prev</a>(<a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> cur)
<a name="l00463"></a>00463 {
<a name="l00464"></a>00464     <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> parent;
<a name="l00465"></a>00465 
<a name="l00466"></a>00466     <span class="comment">/* 如果有左孩子，往左边走 */</span>
<a name="l00467"></a>00467     <span class="keywordflow">if</span> (cur-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a>) {
<a name="l00468"></a>00468         cur = cur-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a>;
<a name="l00469"></a>00469         <span class="comment">/* 找左孩子下最靠右的节点 */</span>
<a name="l00470"></a>00470         <span class="keywordflow">while</span> (cur-&gt;<a class="code" href="struct____sblnk__node.html#a1f41e1366c9345596b528fc6aee3187d" title="右子节点">right</a>)
<a name="l00471"></a>00471             cur = cur-&gt;<a class="code" href="struct____sblnk__node.html#a1f41e1366c9345596b528fc6aee3187d" title="右子节点">right</a>;
<a name="l00472"></a>00472         <span class="keywordflow">return</span> cur;
<a name="l00473"></a>00473     }
<a name="l00474"></a>00474     <span class="comment">/* 如果没有左孩子，向父节点走 */</span>
<a name="l00475"></a>00475     <span class="keywordflow">while</span> ((parent = <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga2b84c86f24154173661a6b15a7f8392f" title="得到父节点">sblnk_parent</a>(cur)) 
<a name="l00476"></a>00476             &amp;&amp; cur == parent-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a>)
<a name="l00477"></a>00477         cur = parent;
<a name="l00478"></a>00478 
<a name="l00479"></a>00479     <span class="keywordflow">return</span> parent;
<a name="l00480"></a>00480 }
<a name="l00481"></a>00481 
<a name="l00482"></a><a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga0d2affd3956b699ba994f82a13b3cf2b">00482</a> NV_IMPL <span class="keywordtype">size_t</span> <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga0d2affd3956b699ba994f82a13b3cf2b" title="计算树的深度">sblnk_depth</a>(<a class="code" href="structsblnk__root.html" title="树根">sblnk_root</a>* root)
<a name="l00483"></a>00483 {
<a name="l00484"></a>00484     <span class="keywordtype">size_t</span> cur_depth;
<a name="l00485"></a>00485     <span class="keywordtype">size_t</span> max_depth = 0;
<a name="l00486"></a>00486     <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> parent;
<a name="l00487"></a>00487     <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> cur = root-&gt;<a class="code" href="structsblnk__root.html#a5b775a8ecc9de098808ca8c7f1e365c4" title="树根节点">node</a>;
<a name="l00488"></a>00488     
<a name="l00489"></a>00489     <span class="keywordflow">if</span> (cur) {
<a name="l00490"></a>00490         cur_depth = 1;
<a name="l00491"></a>00491         <span class="keywordflow">while</span> (cur-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a>) {
<a name="l00492"></a>00492             cur = cur-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a>;
<a name="l00493"></a>00493             ++cur_depth;
<a name="l00494"></a>00494         }
<a name="l00495"></a>00495         max_depth = cur_depth;
<a name="l00496"></a>00496         <span class="keywordflow">do</span> {<span class="comment">/* 如果有右孩子，往右边走 */</span>
<a name="l00497"></a>00497             <span class="keywordflow">if</span> (cur-&gt;<a class="code" href="struct____sblnk__node.html#a1f41e1366c9345596b528fc6aee3187d" title="右子节点">right</a>) {
<a name="l00498"></a>00498                 cur = cur-&gt;<a class="code" href="struct____sblnk__node.html#a1f41e1366c9345596b528fc6aee3187d" title="右子节点">right</a>;
<a name="l00499"></a>00499                 ++cur_depth;
<a name="l00500"></a>00500                 <span class="comment">/* 找右孩子下最靠左的节点 */</span>
<a name="l00501"></a>00501                 <span class="keywordflow">while</span> (cur-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a>) {
<a name="l00502"></a>00502                     cur = cur-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a>;
<a name="l00503"></a>00503                     ++cur_depth;
<a name="l00504"></a>00504                 }
<a name="l00505"></a>00505                 <span class="keywordflow">if</span> (cur_depth &gt; max_depth)
<a name="l00506"></a>00506                     max_depth = cur_depth;
<a name="l00507"></a>00507             } <span class="keywordflow">else</span> {
<a name="l00508"></a>00508                 <span class="comment">/* 如果没有右孩子，向父节点走 */</span>
<a name="l00509"></a>00509                 <span class="keywordflow">while</span> ((parent = <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga2b84c86f24154173661a6b15a7f8392f" title="得到父节点">sblnk_parent</a>(cur)) 
<a name="l00510"></a>00510                         &amp;&amp; cur == parent-&gt;<a class="code" href="struct____sblnk__node.html#a1f41e1366c9345596b528fc6aee3187d" title="右子节点">right</a>) {
<a name="l00511"></a>00511                     cur = parent;
<a name="l00512"></a>00512                     --cur_depth;
<a name="l00513"></a>00513                 }
<a name="l00514"></a>00514                 cur = parent;
<a name="l00515"></a>00515                 --cur_depth;
<a name="l00516"></a>00516             }
<a name="l00517"></a>00517         } <span class="keywordflow">while</span> (cur);
<a name="l00518"></a>00518     }
<a name="l00519"></a>00519     
<a name="l00520"></a>00520     <span class="keywordflow">return</span> max_depth;
<a name="l00521"></a>00521 }
<a name="l00522"></a>00522 
<a name="l00523"></a><a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gab7ece6c8087440945d0a50d8cd81b423">00523</a> NV_IMPL <span class="keywordtype">size_t</span> <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gab7ece6c8087440945d0a50d8cd81b423" title="计算树的叶子数">sblnk_leafs</a>(<a class="code" href="structsblnk__root.html" title="树根">sblnk_root</a>* root)
<a name="l00524"></a>00524 {
<a name="l00525"></a>00525     <span class="keywordtype">size_t</span> leafs = 0;
<a name="l00526"></a>00526     <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> parent;
<a name="l00527"></a>00527     <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> cur = <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gaef5561f1a6e6865d29d001bb05b81d2f" title="得到指向正向起始位置的迭代器">sblnk_begin</a>(root);
<a name="l00528"></a>00528     
<a name="l00529"></a>00529     <span class="keywordflow">while</span> (cur) {
<a name="l00530"></a>00530         <span class="comment">/* 如果有右孩子，往右边走 */</span>
<a name="l00531"></a>00531         <span class="keywordflow">if</span> (cur-&gt;<a class="code" href="struct____sblnk__node.html#a1f41e1366c9345596b528fc6aee3187d" title="右子节点">right</a>) {
<a name="l00532"></a>00532             cur = cur-&gt;<a class="code" href="struct____sblnk__node.html#a1f41e1366c9345596b528fc6aee3187d" title="右子节点">right</a>;
<a name="l00533"></a>00533             <span class="comment">/* 找右孩子下最靠左的节点 */</span>
<a name="l00534"></a>00534             <span class="keywordflow">while</span> (cur-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a>)
<a name="l00535"></a>00535                 cur = cur-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a>;
<a name="l00536"></a>00536         } <span class="keywordflow">else</span> {
<a name="l00537"></a>00537             <span class="keywordflow">if</span> (!cur-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a>)
<a name="l00538"></a>00538                 ++leafs;
<a name="l00539"></a>00539             <span class="comment">/* 如果没有右孩子，向父节点走 */</span>
<a name="l00540"></a>00540             <span class="keywordflow">while</span> ((parent = <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga2b84c86f24154173661a6b15a7f8392f" title="得到父节点">sblnk_parent</a>(cur)) 
<a name="l00541"></a>00541                     &amp;&amp; cur == parent-&gt;<a class="code" href="struct____sblnk__node.html#a1f41e1366c9345596b528fc6aee3187d" title="右子节点">right</a>)
<a name="l00542"></a>00542                 cur = parent;
<a name="l00543"></a>00543             cur = parent;
<a name="l00544"></a>00544         }
<a name="l00545"></a>00545     }
<a name="l00546"></a>00546     
<a name="l00547"></a>00547     <span class="keywordflow">return</span> leafs;
<a name="l00548"></a>00548 }
<a name="l00549"></a>00549 
<a name="l00550"></a><a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gaf5442bb764fe7fd9ff8d796dff0551e0">00550</a> NV_IMPL <span class="keywordtype">void</span> <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gaf5442bb764fe7fd9ff8d796dff0551e0" title="获取树的信息，包括节点数、深度、叶子数">sblnk_get_info</a>(<a class="code" href="structsblnk__root.html" title="树根">sblnk_root</a>* root, <a class="code" href="structsblnk__info.html" title="树信息表">sblnk_info</a>* info)
<a name="l00551"></a>00551 {
<a name="l00552"></a>00552     <span class="keywordtype">size_t</span> cnt = 0;
<a name="l00553"></a>00553     <span class="keywordtype">size_t</span> leafs = 0;
<a name="l00554"></a>00554     <span class="keywordtype">size_t</span> cur_depth;
<a name="l00555"></a>00555     <span class="keywordtype">size_t</span> max_depth = 0;
<a name="l00556"></a>00556     <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> parent;
<a name="l00557"></a>00557     <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> cur = root-&gt;<a class="code" href="structsblnk__root.html#a5b775a8ecc9de098808ca8c7f1e365c4" title="树根节点">node</a>;
<a name="l00558"></a>00558     
<a name="l00559"></a>00559     <span class="keywordflow">if</span> (cur) {
<a name="l00560"></a>00560         cur_depth = 1;
<a name="l00561"></a>00561         <span class="keywordflow">while</span> (cur-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a>) {
<a name="l00562"></a>00562             cur = cur-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a>;
<a name="l00563"></a>00563             ++cur_depth;
<a name="l00564"></a>00564         }
<a name="l00565"></a>00565         max_depth = cur_depth;
<a name="l00566"></a>00566         <span class="keywordflow">do</span> {
<a name="l00567"></a>00567             ++cnt;
<a name="l00568"></a>00568             <span class="comment">/* 如果有右孩子，往右边走 */</span>
<a name="l00569"></a>00569             <span class="keywordflow">if</span> (cur-&gt;<a class="code" href="struct____sblnk__node.html#a1f41e1366c9345596b528fc6aee3187d" title="右子节点">right</a>) {
<a name="l00570"></a>00570                 cur = cur-&gt;<a class="code" href="struct____sblnk__node.html#a1f41e1366c9345596b528fc6aee3187d" title="右子节点">right</a>;
<a name="l00571"></a>00571                 ++cur_depth;
<a name="l00572"></a>00572                 <span class="comment">/* 找右孩子下最靠左的节点 */</span>
<a name="l00573"></a>00573                 <span class="keywordflow">while</span> (cur-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a>) {
<a name="l00574"></a>00574                     cur = cur-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a>;
<a name="l00575"></a>00575                     ++cur_depth;
<a name="l00576"></a>00576                 }
<a name="l00577"></a>00577                 <span class="keywordflow">if</span> (cur_depth &gt; max_depth)
<a name="l00578"></a>00578                     max_depth = cur_depth;
<a name="l00579"></a>00579             } <span class="keywordflow">else</span> {
<a name="l00580"></a>00580                 <span class="keywordflow">if</span> (!cur-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a>)
<a name="l00581"></a>00581                     ++leafs;
<a name="l00582"></a>00582                 <span class="comment">/* 如果没有右孩子，向父节点走 */</span>
<a name="l00583"></a>00583                 <span class="keywordflow">while</span> ((parent = <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga2b84c86f24154173661a6b15a7f8392f" title="得到父节点">sblnk_parent</a>(cur)) 
<a name="l00584"></a>00584                         &amp;&amp; cur == parent-&gt;<a class="code" href="struct____sblnk__node.html#a1f41e1366c9345596b528fc6aee3187d" title="右子节点">right</a>) {
<a name="l00585"></a>00585                     cur = parent;
<a name="l00586"></a>00586                     --cur_depth;
<a name="l00587"></a>00587                 }
<a name="l00588"></a>00588                 cur = parent;
<a name="l00589"></a>00589                 --cur_depth;
<a name="l00590"></a>00590             }
<a name="l00591"></a>00591         } <span class="keywordflow">while</span> (cur);
<a name="l00592"></a>00592     }
<a name="l00593"></a>00593     
<a name="l00594"></a>00594     info-&gt;<a class="code" href="structsblnk__info.html#a76d971a3c552bc58ba9f0d5fceae9806" title="节点数">count</a> = cnt;
<a name="l00595"></a>00595     info-&gt;<a class="code" href="structsblnk__info.html#a820c167ceaaa9759b0ca2695d22db55c" title="深度">depth</a> = max_depth;
<a name="l00596"></a>00596     info-&gt;<a class="code" href="structsblnk__info.html#a62f3b2ad4f6c6147d1bb9a71dd8c9656" title="叶子数">leafs</a> = leafs;
<a name="l00597"></a>00597 }
<a name="l00598"></a>00598 
<a name="l00599"></a><a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gad792d3ec9e12043ac935238471075fd5">00599</a> NV_IMPL <span class="keywordtype">size_t</span> <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gad792d3ec9e12043ac935238471075fd5" title="计算两个节点的迭代距离">sblnk_distance</a>(<a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> first, <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> last)
<a name="l00600"></a>00600 {
<a name="l00601"></a>00601     <span class="keywordtype">size_t</span> dist = 1;
<a name="l00602"></a>00602     
<a name="l00603"></a>00603     <span class="keywordflow">while</span> (first != last) {
<a name="l00604"></a>00604         <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga8977419721a1b85610adb2634f136983" title="迭代器递增">sblnk_inc</a>(first);
<a name="l00605"></a>00605         ++dist;
<a name="l00606"></a>00606     }
<a name="l00607"></a>00607     
<a name="l00608"></a>00608     <span class="keywordflow">return</span> dist;
<a name="l00609"></a>00609 }
<a name="l00610"></a>00610 
<a name="l00611"></a><a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga85091b37cced90e27aace1ed466f15b9">00611</a> NV_IMPL <span class="keywordtype">size_t</span> <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga85091b37cced90e27aace1ed466f15b9" title="计算迭代器的正向索引">sblnk_index_of</a>(<a class="code" href="structsblnk__root.html" title="树根">sblnk_root</a>* root, <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> itr)
<a name="l00612"></a>00612 {
<a name="l00613"></a>00613     <span class="keywordtype">size_t</span> cnt = 0;
<a name="l00614"></a>00614     <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> i = <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gaef5561f1a6e6865d29d001bb05b81d2f" title="得到指向正向起始位置的迭代器">sblnk_begin</a>(root);
<a name="l00615"></a>00615     
<a name="l00616"></a>00616     <span class="keywordflow">while</span> (i &amp;&amp; i != itr) {
<a name="l00617"></a>00617         <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga8977419721a1b85610adb2634f136983" title="迭代器递增">sblnk_inc</a>(i);
<a name="l00618"></a>00618         ++cnt;
<a name="l00619"></a>00619     }
<a name="l00620"></a>00620     
<a name="l00621"></a>00621     <span class="keywordflow">return</span> cnt;
<a name="l00622"></a>00622 }
<a name="l00623"></a>00623 
<a name="l00624"></a><a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gabe9efb0165493808f4e6896a70eda6de">00624</a> NV_IMPL <span class="keywordtype">size_t</span> <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gabe9efb0165493808f4e6896a70eda6de" title="计算迭代器的逆向索引">sblnk_reverse_index_of</a>(<a class="code" href="structsblnk__root.html" title="树根">sblnk_root</a>* root, <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> itr)
<a name="l00625"></a>00625 {
<a name="l00626"></a>00626     <span class="keywordtype">size_t</span> cnt = 0;
<a name="l00627"></a>00627     <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> i = <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga9d5419a171f3b9789e64620f24f122db" title="得到指向逆向起始位置的迭代器">sblnk_rbegin</a>(root);
<a name="l00628"></a>00628     
<a name="l00629"></a>00629     <span class="keywordflow">while</span> (i &amp;&amp; i != itr) {
<a name="l00630"></a>00630         <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga39f8da7ba1e44269c6ec1e7fb0125165" title="迭代器递减">sblnk_dec</a>(i);
<a name="l00631"></a>00631         ++cnt;
<a name="l00632"></a>00632     }
<a name="l00633"></a>00633     
<a name="l00634"></a>00634     <span class="keywordflow">return</span> cnt;
<a name="l00635"></a>00635 }
<a name="l00636"></a>00636 
<a name="l00637"></a>00637 NV_IMPL <span class="keywordtype">void</span> __do_sblnk_recurse_foreach(<a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> cur, 
<a name="l00638"></a>00638                         <span class="keywordtype">void</span> (*fn)(<span class="keywordtype">void</span>*), <span class="keywordtype">size_t</span> offset)
<a name="l00639"></a>00639 {
<a name="l00640"></a>00640     <span class="keywordflow">if</span> (cur) {
<a name="l00641"></a>00641         __do_sblnk_recurse_foreach(cur-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a>, fn, offset);
<a name="l00642"></a>00642         fn(((<span class="keywordtype">char</span>*)cur) - offset);
<a name="l00643"></a>00643         __do_sblnk_recurse_foreach(cur-&gt;<a class="code" href="struct____sblnk__node.html#a1f41e1366c9345596b528fc6aee3187d" title="右子节点">right</a>, fn, offset);
<a name="l00644"></a>00644     }
<a name="l00645"></a>00645 }
<a name="l00646"></a>00646 
<a name="l00647"></a>00647 NV_IMPL <span class="keywordtype">void</span> __do_sblnk_recurse_reverse_foreach(<a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> cur, 
<a name="l00648"></a>00648                         <span class="keywordtype">void</span> (*fn)(<span class="keywordtype">void</span>*), <span class="keywordtype">size_t</span> offset)
<a name="l00649"></a>00649 {
<a name="l00650"></a>00650     <span class="keywordflow">if</span> (cur) {
<a name="l00651"></a>00651         __do_sblnk_recurse_reverse_foreach(cur-&gt;<a class="code" href="struct____sblnk__node.html#a1f41e1366c9345596b528fc6aee3187d" title="右子节点">right</a>, fn, offset);
<a name="l00652"></a>00652         fn(((<span class="keywordtype">char</span>*)cur) - offset);
<a name="l00653"></a>00653         __do_sblnk_recurse_reverse_foreach(cur-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a>, fn, offset);
<a name="l00654"></a>00654     }
<a name="l00655"></a>00655 }
<a name="l00656"></a>00656 
<a name="l00657"></a>00657 NV_IMPL <span class="keywordtype">void</span> __sblnk_serialize(<a class="code" href="structsblnk__root.html" title="树根">sblnk_root</a>* root, <span class="keywordtype">void</span>** buf, <span class="keywordtype">size_t</span> offset)
<a name="l00658"></a>00658 {
<a name="l00659"></a>00659     <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> i = <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gaef5561f1a6e6865d29d001bb05b81d2f" title="得到指向正向起始位置的迭代器">sblnk_begin</a>(root);
<a name="l00660"></a>00660 
<a name="l00661"></a>00661     <span class="keywordflow">while</span> (i) {
<a name="l00662"></a>00662         <span class="keywordtype">void</span>* p = ((<span class="keywordtype">char</span>*)i) - offset;
<a name="l00663"></a>00663         *buf++ = p;
<a name="l00664"></a>00664         <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga8977419721a1b85610adb2634f136983" title="迭代器递增">sblnk_inc</a>(i);
<a name="l00665"></a>00665     }
<a name="l00666"></a>00666 }
<a name="l00667"></a>00667 
<a name="l00668"></a>00668 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">size_t</span> SBLNK_F(<span class="keywordtype">size_t</span> i, <span class="keywordtype">size_t</span> resv)
<a name="l00669"></a>00669 {
<a name="l00670"></a>00670     <span class="keywordflow">if</span> (i + 1 &gt;= resv)
<a name="l00671"></a>00671         <span class="keywordflow">return</span> i + resv;
<a name="l00672"></a>00672     <span class="keywordflow">return</span> (i &lt;&lt; 1) + 1;
<a name="l00673"></a>00673 }
<a name="l00674"></a>00674 
<a name="l00675"></a>00675 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">size_t</span> SBLNK_P(<span class="keywordtype">size_t</span> i, <span class="keywordtype">size_t</span> d, <span class="keywordtype">size_t</span> b)
<a name="l00676"></a>00676 {
<a name="l00677"></a>00677     <span class="keywordflow">return</span> ((i &gt;&gt; d) &lt;&lt; d) + b;
<a name="l00678"></a>00678 }
<a name="l00679"></a>00679 
<a name="l00680"></a>00680 NV_IMPL <span class="keywordtype">void</span> __sblnk_deserialize(<a class="code" href="structsblnk__root.html" title="树根">sblnk_root</a>* root, <span class="keywordtype">char</span>** buf, 
<a name="l00681"></a>00681                                     <span class="keywordtype">size_t</span> cnt, <span class="keywordtype">size_t</span> offset)
<a name="l00682"></a>00682 {
<a name="l00683"></a>00683     <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> pi, pj, pp;
<a name="l00684"></a>00684     <span class="keywordtype">size_t</span> i, r, h, c, t, s, d, lv;
<a name="l00685"></a>00685     <span class="keywordflow">if</span> (!cnt) {
<a name="l00686"></a>00686         root-&gt;<a class="code" href="structsblnk__root.html#a5b775a8ecc9de098808ca8c7f1e365c4" title="树根节点">node</a> = NULL;
<a name="l00687"></a>00687         <span class="keywordflow">return</span>;
<a name="l00688"></a>00688     } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (cnt == 1) {
<a name="l00689"></a>00689         pp = (<a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gaed239b78d6bc2fb4207b3139dc046294" title="迭代器">sblnk_iter</a>)((*buf) + offset);
<a name="l00690"></a>00690         root-&gt;<a class="code" href="structsblnk__root.html#a5b775a8ecc9de098808ca8c7f1e365c4" title="树根节点">node</a> = pp;
<a name="l00691"></a>00691         pp-&gt;<a class="code" href="struct____sblnk__node.html#a0ded92074b972d02336b48bb31f92d06" title="父节点">parent</a> = NULL;
<a name="l00692"></a>00692         pp-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a> = 0;
<a name="l00693"></a>00693         <span class="keywordflow">return</span>;
<a name="l00694"></a>00694     }
<a name="l00695"></a>00695     h = 0; c = 1; lv = 0;
<a name="l00696"></a>00696     s = 1; d = 2; t = cnt;
<a name="l00697"></a>00697     <span class="keywordflow">while</span> (t &gt;&gt;= 1) {
<a name="l00698"></a>00698         ++lv;
<a name="l00699"></a>00699         c &lt;&lt;= 1;
<a name="l00700"></a>00700     }
<a name="l00701"></a>00701     r = cnt - (--c);
<a name="l00702"></a>00702     <span class="keywordflow">while</span> (++h &lt; lv) {
<a name="l00703"></a>00703         i = s - 1;
<a name="l00704"></a>00704         s &lt;&lt;= 1;
<a name="l00705"></a>00705         <span class="keywordflow">while</span> (i &lt; c) {
<a name="l00706"></a>00706             <span class="keywordtype">size_t</span> p = SBLNK_P(i, h + 1, s - 1);
<a name="l00707"></a>00707             pp = (<a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gaed239b78d6bc2fb4207b3139dc046294" title="迭代器">sblnk_iter</a>)
<a name="l00708"></a>00708                 (buf[SBLNK_F(p, r)] + offset);
<a name="l00709"></a>00709             pi = (<a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gaed239b78d6bc2fb4207b3139dc046294" title="迭代器">sblnk_iter</a>)
<a name="l00710"></a>00710                 (buf[SBLNK_F(i, r)] + offset);
<a name="l00711"></a>00711             pp-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a> = pi;
<a name="l00712"></a>00712             i += d;
<a name="l00713"></a>00713             pj = (<a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gaed239b78d6bc2fb4207b3139dc046294" title="迭代器">sblnk_iter</a>)
<a name="l00714"></a>00714                 (buf[SBLNK_F(i, r)] + offset);
<a name="l00715"></a>00715             pp-&gt;<a class="code" href="struct____sblnk__node.html#a1f41e1366c9345596b528fc6aee3187d" title="右子节点">right</a> = pj;
<a name="l00716"></a>00716             pi-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a> = s - 2;
<a name="l00717"></a>00717             pj-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a> = s - 2;
<a name="l00718"></a>00718             pi-&gt;<a class="code" href="struct____sblnk__node.html#a0ded92074b972d02336b48bb31f92d06" title="父节点">parent</a> = pp;
<a name="l00719"></a>00719             pj-&gt;<a class="code" href="struct____sblnk__node.html#a0ded92074b972d02336b48bb31f92d06" title="父节点">parent</a> = pp;
<a name="l00720"></a>00720             <span class="keywordflow">if</span> (h &lt; 2) {
<a name="l00721"></a>00721                 pi-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a> = NULL;
<a name="l00722"></a>00722                 pi-&gt;<a class="code" href="struct____sblnk__node.html#a1f41e1366c9345596b528fc6aee3187d" title="右子节点">right</a> = NULL;
<a name="l00723"></a>00723                 pj-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a> = NULL;
<a name="l00724"></a>00724                 pj-&gt;<a class="code" href="struct____sblnk__node.html#a1f41e1366c9345596b528fc6aee3187d" title="右子节点">right</a> = NULL;
<a name="l00725"></a>00725             }
<a name="l00726"></a>00726             i += d;
<a name="l00727"></a>00727         }
<a name="l00728"></a>00728         d &lt;&lt;= 1;
<a name="l00729"></a>00729     }
<a name="l00730"></a>00730     root-&gt;<a class="code" href="structsblnk__root.html#a5b775a8ecc9de098808ca8c7f1e365c4" title="树根节点">node</a> = pp;
<a name="l00731"></a>00731     pp-&gt;<a class="code" href="struct____sblnk__node.html#a0ded92074b972d02336b48bb31f92d06" title="父节点">parent</a> = NULL;
<a name="l00732"></a>00732     pp-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a> = (s - 1) &lt;&lt; 1;
<a name="l00733"></a>00733     <span class="keywordflow">for</span> (i = 0; i &lt; r; ++i) {
<a name="l00734"></a>00734         pp = (<a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gaed239b78d6bc2fb4207b3139dc046294" title="迭代器">sblnk_iter</a>)
<a name="l00735"></a>00735             (buf[((i &gt;&gt; 1) &lt;&lt; 2) + 1] + offset);
<a name="l00736"></a>00736         pi = (<a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gaed239b78d6bc2fb4207b3139dc046294" title="迭代器">sblnk_iter</a>)
<a name="l00737"></a>00737             (buf[i &lt;&lt; 1] + offset);
<a name="l00738"></a>00738         pi-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a> = NULL;
<a name="l00739"></a>00739         pi-&gt;<a class="code" href="struct____sblnk__node.html#a1f41e1366c9345596b528fc6aee3187d" title="右子节点">right</a> = NULL;
<a name="l00740"></a>00740         <span class="keywordflow">if</span> (i &amp; 1)
<a name="l00741"></a>00741             pp-&gt;<a class="code" href="struct____sblnk__node.html#a1f41e1366c9345596b528fc6aee3187d" title="右子节点">right</a> = pi;
<a name="l00742"></a>00742         <span class="keywordflow">else</span>
<a name="l00743"></a>00743             pp-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a> = pi;
<a name="l00744"></a>00744         pi-&gt;<a class="code" href="struct____sblnk__node.html#a0ded92074b972d02336b48bb31f92d06" title="父节点">parent</a> = pp;
<a name="l00745"></a>00745         pi-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a> = 0;
<a name="l00746"></a>00746         <span class="keywordflow">do</span> {<span class="comment">/* 更新大小域 */</span>
<a name="l00747"></a>00747             ++pp-&gt;<a class="code" href="struct____sblnk__node.html#a854352f53b148adc24983a58a1866d66" title="子树大小">size</a>;
<a name="l00748"></a>00748         } <span class="keywordflow">while</span> (pp = pp-&gt;<a class="code" href="struct____sblnk__node.html#a0ded92074b972d02336b48bb31f92d06" title="父节点">parent</a>);
<a name="l00749"></a>00749     }
<a name="l00750"></a>00750 }
<a name="l00751"></a>00751 
<a name="l00752"></a>00752 <span class="preprocessor">#ifdef __cplusplus</span>
<a name="l00753"></a>00753 <span class="preprocessor"></span>}
<a name="l00754"></a>00754 <span class="preprocessor">#endif  </span><span class="comment">/* #ifdef __cplusplus */</span>
</pre></div></div>
</div>
<!--- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark">&#160;</span>全部</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark">&#160;</span>数据结构</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark">&#160;</span>文件</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark">&#160;</span>函数</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark">&#160;</span>变量</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark">&#160;</span>类型定义</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark">&#160;</span>宏定义</a></div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<hr class="footer"/><address class="footer"><small>Generated at 2015年七月16日 星期四 12:00:37 for Navo Portable Library by&#160;
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.7.3 </small></address>
</body>
</html>
